Optimal control of some queueing networks

Optimal Power Control for Wireless Queueing Networks

In this paper, we address the problem of power control in wireless queueing networks. We consider a discrete time (slotted) wireless system of single link. Data arrive in packets according to a Bernoulli process of rate λ. A simple ARQ (send and wait) retransmission policy is used for the transmission of packets. The control parameter in this system is the transmission power of a packet, which ...

Monotone control of queueing networks

This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates....

The Complexity of Optimal Queueing Network Control

[6,11] by reducing them to extensions of the multi-We consider the classical problem of optimal control armed bandit problem, the problem of repeatedly se-(routing and sequencing) of a network of queues. We lecting one among many Markov processes, each with prove that this problem is EXP-complete and, there-known transition probabilities and costs. The latter fore, provably intractable. Similar...

Heavy TraÆ Limits for Some Queueing Networks

Optimal capacity assignment in general queueing networks

We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...